| 1. |
- Behnam, Moris, et al.
(author)
-
Towards an efficient approach for resource sharing in real-time multiprocessor systems
- 2011
-
In: 2011 6th IEEE International Symposium on Industrial and Embedded Systems. - Västerås : IEEE. - 9781612848181 - 9781612848198 ; , s. 99-102, s. 99-102
-
Conference paper (peer-reviewed)abstract
- Supporting resource sharing in multiprocessor architectures is one of the major problems that limit the potential performance benefits of using such architectures for real-time systems. Many approaches and algorithms have been proposed to support resource sharing, however, most of them impose either high blocking times on tasks or require a large memory allocation. In this paper we investigate the possibility of combining the lock-based approaches and wait-free approaches (using multiple buffers) in order to decrease both the blocking times that may affect the schedulability of tasks and the required memory. To achieve this, we propose a solution based on evaluating the maximum allowed blocking time on each task according to the schedulability analysis, and then find the minimum memory allocation for each resource that limits the blocking times on tasks to be less than the maximum allowed blocking times.
|
|
| 2. |
- Nemati, Farhang, Senior Lecturer, 1975-, et al.
(author)
-
Independently-Developed Real-Time Systems on Multi-Cores with Shared Resources
- 2011
-
In: 2011 23rd Euromicro Conference on Real-Time Systems. - Porto, Portugal : IEEE. - 9781457706431 ; , s. 251-261, s. 251-261
-
Conference paper (peer-reviewed)abstract
- In this paper we propose a synchronization protocol for resource sharing among independently-developed real-time systems on multi-coreplatforms. The systems may use different scheduling policies and they may have their own local priority settings. Each system is allocated on a dedicated processor (core). In the proposed synchronization protocol, each system is abstracted by an interface which abstracts the information needed for supporting global resources. The protocol facilitates the composability of various real-time systems with different scheduling and priority settings on a multi-core platform. We have performed experimental evaluations and compared the performance of our proposed protocol (MSOS) against the two existing synchronization protocols MPCP and FMLP. The results show that the new synchronization protocol enables composability without any significant loss of performance. In fact, in most cases the new protocol performs better than at least one of the other two synchronization protocols. Hence, we believe that the proposed protocol is a viable solution for synchronization among independently-developedreal-time systems executing on a multi-core platform.
|
|
| 3. |
- Nemati, Farhang, Senior Lecturer, 1975-, et al.
(author)
-
Sharing Resources among Independently-developed Systems on Multi-cores
- 2011
-
In: ACM SIGBED Review. - New York : ACM SIGBED. - 1551-3688. ; 8:1, s. 46-53
-
Journal article (peer-reviewed)abstract
- In this paper we propose a synchronization protocol for resource sharing among independently-developed real-time systems on multi-core platforms. The systems may use different scheduling policies and they may have arbitrary priority settings. When using this synchronization protocol each processor is abstracted by an interface which consists of a set of requirements. A requirement depends only on the worst-case time the processor may wait for resources, i.e., the maximum number of times that the resources can be blocked by other processors. We have derived schedulability conditions for each processor and based on the analysis we extract the interface of the processor. In this paper, we focus on the cases when each system is allocated on a dedicated processor.
|
|
